Positively curved cubic plane graphs are finite
نویسندگان
چکیده
Let G be an infinite plane graph such that G is locally finite and every face of G is bounded by a cycle. Then G is said to be positively curved if, for every vertex x of G, 1− d(x)/2 + Σx∈F 1 |F | > 0, where the summation is taken over all facial cycles F containing x. Note that if G is positively curved then the maximum degree of G is at most 5. As a discrete analogue of a result in Riemannian geometry, Higuchi conjectured that if G is positively curved then G is finite. In this paper, we establish this conjecture for cubic graphs. Partially supported by a grant from China Scholarship Council Partially supported by NSF grant DMS-9970527
منابع مشابه
Forcing faces in plane bipartite graphs
Let denote the class of connected plane bipartite graphs with no pendant edges. A finite face s of a graphG ∈ is said to be a forcing face ofG if the subgraph ofG obtained by deleting all vertices of s together with their incident edges has exactly one perfect matching. This is a natural generalization of the concept of forcing hexagons in a hexagonal system introduced in Che and Chen [Forcing ...
متن کاملCubic symmetric graphs of orders $36p$ and $36p^{2}$
A graph is textit{symmetric}, if its automorphism group is transitive on the set of its arcs. In this paper, we classifyall the connected cubic symmetric graphs of order $36p$ and $36p^{2}$, for each prime $p$, of which the proof depends on the classification of finite simple groups.
متن کاملSymmetric Cubic Graphs of Girth at Most 7
By a symmetric graph we mean a graph X which automorphism group acts transitively on the arcs of X. A graph is s-regular if its automorphism group acts regularly on the set of its s-arcs. Tutte [31, 32] showed that every finite symmetric cubic graph is s-regular for some s ≤ 5. It is well-known that there are precisely five symmetric cubic graphs of girth less than 6. All these graphs can be re...
متن کاملIntersection between Bi-cubic Bezier Curved Surface and Plane
The paper presents a solution to calculate intersection between a plane and bi-cubic Bezier curved surface. The paper first constructs bounding box based on the control grid by the characteristics of the Bezier surface, and then makes use of the plane half-space properties to convert the problem that calculates the intersection line between the plane and the parameter curved surface into calcul...
متن کاملDistance and routing labeling schemes for non-positively curved plane graphs
Distance labeling schemes are schemes that label the vertices of a graph with short labels in such a way that the distance between any two vertices u and v can be determined efficiently (e.g., in constant or logarithmic time) by merely inspecting the labels of u and v, without using any other information. Similarly, routing labeling schemes are schemes that label the vertices of a graph with sh...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of Graph Theory
دوره 47 شماره
صفحات -
تاریخ انتشار 2004